On the Chromatic Number of Random Cayley Graphs
نویسندگان
چکیده
منابع مشابه
The chromatic number of random Cayley graphs
We consider the typical behaviour of the chromatic number of a random Cayley graph of a given group of order n with respect to a randomly chosen set of size k ≤ n/2. This behaviour depends on the group: for some groups it is typically 2 for all k < 0.99 log2 n, whereas for some other groups it grows whenever k grows. The results obtained include a proof that for any large prime p, and any 1 ≤ k...
متن کاملOn the Chromatic Number of Random Graphs
In this paper we consider the classical Erdős-Rényi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ, for any fixed δ > 0, the chromatic number χ(Gn,p) is a.a.s. , +1, or +2, where is the maximum integer satisfying 2( −1) log( −1) ≤ p(n−1).
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملOn the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2016
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548316000304